#include <cstdlib>
#include <cstdio>
#include "../Basics/BasicStruct.cpp"

// 中序遍历二叉树

void BSTTree(TreeNode* bt) {
    if (bt == NULL) {
        return;
    }
    BSTTree(bt->leftChild);
    printf("%d ",bt->data);
    BSTTree(bt->rightChild);
}

int main() {


    /*
    *       1
    *      / \
    *     2   3
    *        / \
    *       4   5
    * */
    TreeNode *root = CreateTree();
    BSTTree(root);
}

